Path Summaries and Path Partitioning in Modern XML Databases
نویسندگان
چکیده
منابع مشابه
Path Constraints in Semistructured Databases
General rights Copyright for the publications made accessible via the Edinburgh Research Explorer is retained by the author(s) and / or other copyright owners and it is a condition of accessing these publications that users recognise and abide by the legal requirements associated with these rights. Take down policy The University of Edinburgh has made every reasonable effort to ensure that Edin...
متن کاملBenefits of Path Summaries in an XML Query Optimizer Supporting Multiple Access Methods
Toronto, ON, Canada [email protected] 3G4, Toron
متن کاملXML Transclusions: a Feasible Path
The idea of transclusion has been at the same time the strength and weakness of Xanadu: some people considered it as an extremely powerful mechanism to get any version of any fragment of any document in a global shared document space, others as a very complex solution too difficult to be actually implemented and delivered. We believe transclusions are still worth implementing and would allow de...
متن کاملExtended Path Expressions for XML
Query languages for XML often use path expressions to locate elements in XML documents. Path expressions are regular expressions such that underlying alphabets represent conditions on nodes. Path expressions represent conditions on paths from the root, but do not represent conditions on siblings, siblings of ancestors, and descendants of such siblings. In order to capture such conditions, we pr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: World Wide Web
سال: 2007
ISSN: 1386-145X,1573-1413
DOI: 10.1007/s11280-007-0036-7